This paper proposes a compromise model, based on the technique for order preference through similarity ideal solution (TOPSIS) methodology, to solve the multi-objective large-scale linear programming (MOLSLP) problems with BLOCK ANGULAR STRUCTURE involving fuzzy parameters. The problem involves fuzzy parameters in the objective functions and constraints. This compromise programming method is based on the assumption that the optimal alternative is closer to fuzzy positive ideal solution (FPIS) and at the same time, farther from fuzzy negative ideal solution (FNIS). An aggregating function that is developed from LP- metric is based on the particular measure of ‘‘closeness” to the ‘‘ideal” solution. An efficient distance measurement is utilized to calculate positive and negative ideal solutions. The solution process is as follows: first, the decomposition algorithm is used to divide the large-dimensional objective space into a two dimensional space. A multi-objective identical crisp linear programming is derived from the fuzzy linear model for solving the problem. Then, a single-objective large-scale linear programming problem is solved to find the optimal solution. Finally, to illustrate the proposed method, an illustrative example is provided.

Background and Aim: ANGULAR cheilitis is a common condition among dental patients. However, it often responds poorly to antifungal treatment, and the use of corticosteroids can lead to lesion recurrence or medication resistance. This study aimed to assess the frequency of Staphylococcus aureus in patients who visited the Oral and Maxillofacial Medicine Department at Yazd Dental Faculty in 2017. Methods: This case- control study included 163 participants, with 65 patients diagnosed with ANGULAR cheilitis in the case group and 98 healthy individuals in the control group. Swabs were collected and inoculated on blood agar and Sabouraud dextrose agar. The cultures were then examined for the presence of Staphylococcus aureus and Candida albicans. Data were analyzed using SPSS software, employing Chi- square and t-tests, with a significance level set at  p < 0.05. Results: The study included 98 healthy individuals and 65 patients with ANGULAR cheilitis. The results indicated that Staphylococcus aureus was not detected in either the patient or control group (p < 0.9). A higher prevalence of ANGULAR cheilitis was observed among female patients. Additionally, there was a direct correlation between the presence of ANGULAR cheilitis and Candida albicans. Conclusion: The findings suggest that Staphylococcus aureus is not a contributing factor in ANGULAR cheilitis lesions. Therefore, antibiotic treatment for refractory cases should be postponed until microbial cultures confirm bacterial involvement.

This paper proposes a model on the basis of VlseKriterijumska Optimizacija I Kompromisno Resenje (VIKOR) methodology as a compromised method to solve the Multi-Objective Large-Scale Nonlinear Programming (MOLSNLP) problems with BLOCK ANGULAR STRUCTURE involving fuzzy coefficients. The proposed method is introduced for solving large scale nonlinear programming in fuzzy environment for first time. The problem involves fuzzy coefficients in both objective functions and constraints. In this method, an aggregating function developed from LP- metric is based on the particular measure of \closeness" to the \ideal" solution. The solution process is composed of two steps: First, the decomposition algorithm is utilized to reduce the q-dimensional objective space into a one-dimensional space. Then a multi-objective identical crisp non-linear programming is derived from each fuzzy non-linear model for solving the problem. Second, for finding the final solution, a single-objective large-scale nonlinear programming problem is solved. In order to justify the proposed method, an illustrative example is presented and followed by description of the sensitivity analysis.

This paper proposes a compromise model, based on a new method, to solve the multi-objective largescale linear programming (MOLSLP) problems with BLOCK ANGULAR STRUCTURE involving fuzzy parameters. The problem involves fuzzy parameters in the objective functions and constraints. In this compromise programming method, two concepts are considered simultaneously. First of them is that the optimal alternative is closer to fuzzy positive ideal solution (FPIS) and farther from fuzzy negative ideal solution (FNIS). Second of them is that the proposed method provides a maximum ‘‘group utility’’ for the ‘‘majority’’ and a minimum of an individual regret for the ‘‘opponent’’. In proposed method, the decomposition algorithm is utilized to reduce the large-dimensional objective space. A multi objective identical crisp linear programming is derived from the fuzzy linear model for solving the problem. Then, a compromise solution method is applied to solve each sub problem based on TOPSIS and VIKOR simultaneously. Finally, to illustrate the proposed method, an illustrative exampleis provided.

Nowadays, the fundamental role of having a purpose for life in physical and mental health has been confirmed. According to victor frankl, presence of a purpose in life gives life a meaning and increases resilience against pains and traumas. The importance of the purpose in life construct reveals the need for a reliable and valid tool to measure it. Crumbaugh and Maholick's purpose in life questionnaire is the first and one of the most applied tools for the assessment of life's purposefulness. The aim of this research is to determine the factor STRUCTURE of purpose in life questionnaire. The questionnaire was administered on 206 students who were selected through random stratified sampling at Ferdowsi University of Mashhad. Exploratory factor analysis showed that there are two factors "comprehension" and "purpose" and this finding were confirmed by confirmatory factor analysis. Altogether results of this research showed factor validity of the purpose in life questionnaire with a two factor pattern

BLOCK ciphers have wide applications for hardware and software implementations. In this paper, a new BLOCK cipher algorithm with provable security is proposed. The whole STRUCTURE of the algorithm is novel and has a good encryption and decryption performance. Additionally, it has good security with few number of rounds. The STRUCTURE of the proposed algorithm consists of 4-rounds Feistel-Like which uses 3-rounds Feistel type functions. Moreover, a new method for MDS (Maximal Distance Separable) Matrix construction is proposed and used in the round function as a linear layer. Furthermore, some considerations in S-Boxes of the algorithm lead to obtaining better algebraic expression than AES S-boxes. The Algorithm has a high margin of security against various cryptanalysis methods due to using specific functions in its round functions. Our theoretical evaluations show that the devised cipher algorithm has provable security against attacks based on linear and differential cryptanalysis and it is robust against differential, truncated differential, boomerang, and integral cryptanalysis in terms of practical security.

If a matrix is square and nonsingular namely its rows (or columns) are linear independent, it is said that the matrix is invertible. In recent years, in various fields of applied mathematics, there has been a need to find the inverse of singular and rectANGULAR matrices. Therefore, an inverse was defined that founds the inverse for larger class of nonsingular matrices while still having some properties of conventional inverse which gives the same inverse when the matrix is nonsingular. This inverse is called generalized inverse or quasi-inverse. In this paper, the most common types of such inverse are investigated.

In this paper, we design a lightweight and modified random key generation for PRESENT BLOCK cipher which is applicable in the encryption of the digital signals. In the BLOCK ciphers, the master key is used directly in the encryption process for the data (plaintext). But in this work, a master key (initial key) is used to derive the new random master keys (random session keys) and use these keys for the encryption process. The use of random keys will overcome the brute force attack that can be applied to the PRESENT cipher. The random session keys generated will produce different ciphertexts for the same plaintext for every session. In this approach, we take advantage of the BLOCK cipher to produce random keys. The PRESENT cipher is shared in both random key generation and encryption process. Therefore, the proposed STRUCTURE has both random key generation and data encryption in a unified circuit. This property reduces hardware resources. The implementation results, in 180 nm CMOS technologies, show the proposed STRUCTURE is comparable in terms of area and delay with other works.